binding number造句
例句與造句
- Binding number and minimum degree conditions for graphs to have fractional factors
圖有分?jǐn)?shù)因子的聯(lián)結(jié)數(shù)和最小度條件 - The properties of binding number are discussed , the value scope of binding number is obtained , and the existence of digraphs with a given binding number is proved . two conjectures on the relationship between binding number and girth are proposed
在此基礎(chǔ)上，論文討論了有向圖結(jié)合數(shù)的性質(zhì)，得到了結(jié)合數(shù)的范圍并論證了給定結(jié)合數(shù)的有向圖的摘要存在性，提出了關(guān)于結(jié)合數(shù)與圍長(zhǎng)之間聯(lián)系的兩個(gè)猜想 - They are binding number , scattering number , integrity and edge - integrity , tenacity and edge - tenacity , toughness etc . these parameters show the most serious damage and the situation of a network after the damage simultaneously , so they measure the connectivity of graphs more accurate
這些參數(shù)同時(shí)反映了一個(gè)網(wǎng)絡(luò)可能遭到的最大程度的破壞和被最大程度破壞后剩余部分的工作狀態(tài)，因此更好地刻畫(huà)了圖的連通性。 - In chapter 4 , the conception of binding number of undirected graphs is introduced to digraphs , based on which the relationship between degree condition of vertices and girth is generalized to the relationship between neighborhood condition of vertices sets and girth
由于若無(wú)向圖g的結(jié)合數(shù)b ( g ) 3 / 2 ，則g中存在三角形，而caccetta - h ( ? ) ggkvist猜想研究有向圖中存在有向三角形的條件，受此啟發(fā)，我們?cè)谟悬c(diǎn)向圖中引入結(jié)合數(shù)的概念。 - Also , the binding numbers of some special digraphs are computed and the relationship between binding number and connectivity is analyzed . at the end of the thesis , we give an overview of the whole contents of the thesis and also propose some problems for further research
最后，我們對(duì)本論文的結(jié)果加以總結(jié)，歸納了文章中提出的或遺留的問(wèn)題，給出了論文中提到的有向圖中尚未解決的猜想之間的相互關(guān)系，并對(duì)進(jìn)一步的研究給予展望 - It's difficult to find binding number in a sentence. 用binding number造句挺難的
- This thesis contributes to directed cycles in digraphs , including the relations between the girth g ( d ) ( length of the shortest directed cycle ) of d and degrees of vertices of d and between the shortest directed cycle of d and the binding number of d , among which vertex - transitive digraphs are studied in detail
本篇論文主要研究有向圖中的有向圈，討論有向圖中的圍長(zhǎng)g ( d ) (最短有向圈的長(zhǎng)度)與圖的頂點(diǎn)度以及結(jié)合數(shù)之間的關(guān)系，并重點(diǎn)分析了點(diǎn)可遷圖類(lèi)。